Generalized Minimum Distance Decoding for Correcting Array Errors
نویسندگان
چکیده
We consider an array error model for data in matrix form, where the corrupted symbols are confined to a number of lines (rows and columns) of the matrix. Codes in array metric (maximum term rank metric) are well suited for error correction in this case. We generalize the array metric to the case when the reliability of every line of the matrix is available. We propose a minimum distance decoder for the generalized metric and estimate the guaranteed error correcting radius for this decoder.
منابع مشابه
MDS array codes for correcting a single criss-cross error
We present a family of Maximum-Distance Separable (MDS) array codes of size ( 1) ( 1), a prime number, and minimum criss-cross distance 3, i.e., the code is capable of correcting any row or column in error, without a priori knowledge of what type of error occurred. The complexity of the encoding and decoding algorithms is lower than that of known codes with the same error-correcting power, sinc...
متن کاملLecture 28 : Generalized Minimum Distance Decoding November 5 , 2007
This condition is implied by (1). Thus, we have proved one can correct e errors under (1). Now we have to prove that one can correct the s erasures under (1). Let z′ be the output after correcting e errors. Now we extend z′ to z ∈ (F∪ {?}) in the natural way. Finally, run the erasure decoding algorithm on z. This works as long as s < (n− k + 1), which in turn is true by (1). The time complexity...
متن کاملEnd-to-End Error-Correcting Codes on Networks with Worst-Case Symbol Errors
The problem of coding for networks experiencing worst-case symbol errors is considered. We argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting schemes can be arbitrarily far from achieving the optimal network throughput. A new transform metric for errors under the considered model is proposed. ...
متن کاملApproaching Miscorrection-free Performance of Product and Generalized Product Codes
Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the component codes. For this coding scheme, undetected errors in the component decoding—also known as miscorrections— significantly degrade the performance. In th...
متن کاملThe minimum distance of codes in an array coming from telescopic semigroups
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes and a decoding algorithm which decodes up to half this bound. This gives a unified point of view which explains several improvements on the minimum distance of algebraic-geometric codes. Moreover it is explained in terms of linear algebra and the theory of semigroups only.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010